On linear weak predictability with single point spectrum degeneracy
نویسندگان
چکیده
The paper studies predicting problems for continuous time signals with the Fourier transforms vanishing a certain rate at single point. It shows that, some linear causal predictors, anticausal convolution integrals over future times these processes can be approximated by convolutions past times. corresponding kernels are invariant, and they presented explicitly in frequency domain via their transfer functions. These predictors “universal” meaning that do not require to know details of spectrum underlying signals; same predictor used entire class point degeneracy. feature robustness respect noise contamination.
منابع مشابه
Pathwise continuous time spectrum degeneracy at a single point and weak predictability
The paper studies properties of continuous time processes in pathwise deterministic setting with spectrum degeneracy at a single point where their Fourier transforms vanish. It appears that these processes are predictable is some weak sense, meaning that convolution integrals over future time can be approximated by integrals over past time. In particular, this means that the processes with this...
متن کاملPredictability of sequences and subsequences with spectrum degeneracy at periodically located points
The paper established sufficient conditions of predictability with degeneracy for the spectrum at M periodically located isolated points on the unit circle. It is also shown that m-periodic subsequences of these sequences are also predictable if m is a divisor of M . The predictability can be achieved for finite horizon with linear predictors defined by convolutions with certain kernels. As an ...
متن کاملDegeneracy in interior point methods for linear programming
No part of this Journal may be reproduced in any form, by print, photoprint, mi-croolm or any other means without written permission from Faculty of Technical The publication of Karmarkar's paper has resulted in intense research activity into interior{point algorithms for linear programming. Degeneracy is present in most real{life problems and has always been an important issue in linear progra...
متن کاملA note on degeneracy in linear programming
An interesting question is raised in [I] about the role of degeneracy in the worst-case complexity of the randomized simplex algorithm. It is well known that every linear programming problem can be perturbed into a non-degenerate problem [3, 41. However, it is interesting to know how hard the problem is of "exiting" a degenerate vertex in a direction that improves the objective function value. ...
متن کاملSingle Spectrum End Point Predict of BOF with SVM
SVM ( Support Vector Machine ) is a new method in the artificial neural network ( ANN ). In the steel making, how to use computer to predict the end point of BOF accuracy is a great problem. A lot of method and theory have been claimed, but most of the results is not satisfied. Now the hot topic in the BOF end point predicting is to use optical way the predict the end point in the BOF. And we f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied and Computational Harmonic Analysis
سال: 2021
ISSN: ['1096-603X', '1063-5203']
DOI: https://doi.org/10.1016/j.acha.2021.01.005